By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Optimization

Table of Contents
Volume 17, Issue 4, pp. 943-1257

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Stationarity Results for Generating Set Search for Linearly Constrained Optimization

Tamara G. Kolda, Robert Michael Lewis, and Virginia Torczon

pp. 943-968

Convex Approximations of Chance Constrained Programs

Arkadi Nemirovski and Alexander Shapiro

pp. 969-996

Determinant Maximization of a Nonsymmetric Matrix with Quadratic Constraints

Serge Dégerine and Abdelhamid Zaïdi

pp. 997-1014

A Proximal-Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming

Krzysztof C. Kiwiel

pp. 1015-1034

Transposition Theorems and Qualification-Free Optimality Conditions

Hermann Schichl and Arnold Neumaier

pp. 1035-1055

Lyapunov Stability of Complementarity and Extended Systems

M. Kanat Camlibel, Jong-Shi Pang, and Jinglai Shen

pp. 1056-1101

SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization

Michael W. Carter, Holly H. Jin, Michael A. Saunders, and Yinyu Ye

pp. 1102-1128

Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones

Akiko Yoshise

pp. 1129-1153

The Lagrange Multiplier Rule for Multifunctions in Banach Spaces

Xi Yin Zheng and Kung Fu Ng

pp. 1154-1175

New Reduction Techniques for the Group Steiner Tree Problem

Carlos Eduardo Ferreira and Fernando M. de Oliveira Filho

pp. 1176-1188

The Image Containment Problem and Some Classes of Polynomial Instances

Raffaele Pesenti and Franca Rinaldi

pp. 1189-1204

The Lojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems

Jérôme Bolte, Aris Daniilidis, and Adrian Lewis

pp. 1205-1223

Quadratic Matrix Programming

Amir Beck

pp. 1224-1238

Maximal Monotonicity for the Precomposition with a Linear Operator

Radu Ioan Bot, Sorin-Mihai Grad, and Gert Wanka

pp. 1239-1252

An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints: Erratum

Masao Fukushima and Paul Tseng

pp. 1253-1257